package org.lixiong.seralizable;

public class RecursionTest {
	
	public static void main(String[] args) {
		System.out.println(T(100));
	}

	public static long T(int n) {
		long[] tm = new long[101];
		tm[1] = 1;
		tm[2] = 2;
		for (int i = 3; i <= n; i++)
			tm[i] = tm[i - 1] + tm[i - 2];

		return tm[n];
	}
}
